The Irresistible SRIQ
نویسندگان
چکیده
Motivated primarily by medical terminology applications, the prominent DL SHIQ has already been extended to a DL with complex role inclusion axioms of the form R ◦ S v̇ R or S ◦ R v̇ R, called RIQ, and the SHIQ tableau algorithm has been extended to handle such inclusions. This paper further extends RIQ and its tableau algorithm with important expressive means that are frequently requested in ontology applications, namely with reflexive, symmetric, transitive, and irreflexive roles, disjoint roles, and the construct ∃R.Self, allowing, for instance, the definition of concepts such as a “narcist”. Furthermore, we extend the algorithm to cover Abox reasoning extended with negated role assertions. The resulting logic is called SRIQ.
منابع مشابه
An Automata-based algorithm for description logics around SRIQ
In this paper we use automata-theoretic techniques to tightly characterize the worst-case complexity of the knowledge base satisfiability problem for the very expressive Description Logics (DLs) ALCQIb+reg and SRIQ. The logic ALCQIb + reg extends ALC with qualified number restrictions, inverse roles, safe Boolean role expressions, regular expressions over roles, and concepts of the form ∃P.Self...
متن کاملModule-theoretic Properties of Reachability Modules for SRIQ
In this paper we investigate the module-theoretic properties of ⊥− and >-reachability modules in terms of inseparability relations for the DL SRIQ. We show that, although these modules are not depleting or self-contained, they share the robustness properties of syntactic locality modules and preserve all justifications for an entailment.
متن کاملA Practical Acyclicity Notion for Query Answering Over Horn- SRIQ Ontologies
Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes. We show that this notion generalizes most of the ex...
متن کاملExtending Consequence-Based Reasoning to SRIQ
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed for either Horn DLs (which do not support disjunction), or for DLs without counting quantifiers. In this paper we present a novel consequence-based calculus...
متن کاملA Decidable Extension of SRIQ with Disjunctions in Complex Role Inclusion Axioms
This paper establishes the decidability of SR⊔IQ which has composition-based role Inclusion axioms (RIAs) of the form R1 ◦ · · · ◦ Rn⊑̇T1 ⊔ · · · ⊔ Tm. Also the consistency of an Abox A of SR⊔IQ DL w.r.t. Rbox R is established. Motivation for this kind of RIAs comes from applications in the field of manufactured products as well as other conceptual modeling applications such as family relationsh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005